Asymptotic Analysis of Multidimensional Jittered Sampling

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correlated Multi-Jittered Sampling

Image synthesis techniques requiringMonteCarlo integration frequentlyneed to generate uniformly distributed samples within the unit hypercube. The ideal sample generation method will maximize the variance reduction as the numberof samples increases. Strati cationvia jittering is one simple, tractable, R. L. Cook. Stochastic sampling in computer graphics. ACM Transactions on Graphics, 5(1):51–72...

متن کامل

On the discrepancy of jittered sampling

We study the discrepancy of jittered sampling: a jittered sampling set P ⊂ [0, 1]d is generated for fixed m ∈ N by partitioning [0, 1]d into md axis aligned cubes of equal measure and placing a random point inside each of the N = md cubes. We prove that, for N sufficiently large, 1 10 d N 1 2 + 1 2d ≤ ED∗ N (P) ≤ √ d(logN) 1 2

متن کامل

Linear Signal Reconstruction from Jittered Sampling

This paper presents an accurate and simple method to evaluate the performance of AD/DA converters affected by clock jitter, which is based on the analysis of the mean square error (MSE) between the reconstructed signal and the original one. Using an approximation of the linear minimum MSE (LMMSE) filter as reconstruction technique, we derive analytic expressions of the MSE. Through asymptotic a...

متن کامل

Efficient Multidimensional Sampling

Image synthesis often requires the Monte Carlo estimation of integrals. Based on a generalized concept of stratification we present an efficient sampling scheme that consistently outperforms previous techniques. This is achieved by assembling sampling patterns that are stratified in the sense of jittered sampling and N-rooks sampling at the same time. The faster convergence and improved anti-al...

متن کامل

Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes

Recent work of Brlek et al. gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic description of digitally convex polyominoes and use it to analyze their limit properties and build a uniform sampler. Experimentally, our sampler shows a limit shape for large digitally convex polyominoes. Introduction In discrete ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2010

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2009.2028096